Incremental Association Mining using a Closed-Set Lattice
نویسندگان
چکیده
The use of closed-set algorithms to generate condensed accurate representations of a dataset’s frequent itemsets has been well documented. This paper presents a novel approach to incremental association mining in which the maintenance of the set of frequent itemsets is based upon the evolution of a closed-set lattice. This approach also creates a closed-set representation of the increment dataset, providing the user with insight to the increment’s effect upon the maintained lattice and provides an effective means of incorporating windowing functionality. Additional
منابع مشابه
A framework for incremental generation of closed itemsets
Association rule mining from a transaction database (TDB) requires the detection of frequently occurring patterns, called frequent itemsets (FIs), whereby the number ofFIsmay be potentially huge. Recent approaches forFImining use the closed itemset paradigm to limit themining effort to a subset of the entireFI family, the frequent closed itemsets (FCIs).We show here howFCIs can bemined incremen...
متن کاملGenerating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
Galois (concept) lattice theory has been successfully applied to the resolution of the association rule problem in data mining. In particular, structural results about lattices have been used in the design of efficient procedures for mining the frequent patterns (itemsets) in a transaction database. As transaction databases are often dynamic, we propose a detailed study of the incremental aspec...
متن کاملUsing a Reinforced Concept Lattice to Incrementally Mine Association Rules from Closed Itemsets
In the Data Mining area, discovering association rules is one of the most important task. It is well known that the number of these rules rapidly grows to be unwieldy as the frequency requirements become less strict, especially when collected data is highly correlated or dense. Since a big number of the frequent itemsets turns out to be redundant, it is sufficient to consider only the rules amo...
متن کاملMining Closed-Regular Patterns in Incremental Transactional Databases using Vertical Data Format
Regular pattern mining on Incremental Databases is a novel approach in Data Mining Research. Recently closed item set mining has gained lot of consideration in mining process. In this paper we propose a new mining method called CRPMID (Closed-regular Pattern Mining on Incremental Databases) with sliding window technique using Vertical Data format. This method generates complete set of closed-re...
متن کاملFast Algorithms for Mining Generalized Frequent Patterns of Generalized Association Rules
Mining generalized frequent patterns of generalized association rules is an important process in knowledge discovery system. In this paper, we propose a new approach for efficiently mining all frequent patterns using a novel set enumeration algorithm with two types of constraints on two generalized itemset relationships, called subset-superset and ancestor-descendant constraints. We also show a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Research and Practice in Information Technology
دوره 39 شماره
صفحات -
تاریخ انتشار 2007